An algebraic construction of sum-integral interpolators
نویسندگان
چکیده
This paper presents an algebraic construction of Euler-Maclaurin formulas for polytopes. The obtained generalize and unite the previous lattice point Morelli Pommersheim-Thomas, Berline-Vergne While approach this originates in theory toric varieties, recovers results about characteristic classes present is self-contained does not rely on from geometry. We aim particular to exhibit a combinatorial way ingredients such as Todd cycle-level intersections Chow rings, that first entered polytopes
منابع مشابه
Sum-integral Interpolators and the Euler-maclaurin Formula for Polytopes
A local lattice point counting formula, and more generally a local Euler-Maclaurin formula follow by comparing two natural families of meromorphic functions on the dual of a rational vector space V , namely the family of exponential sums (S) and the family of exponential integrals (I) parametrized by the set of rational polytopes in V . The paper introduces the notion of an interpolator between...
متن کاملBiCMOS Colpitts Oscillator for Vector- Sum Interpolators
Purpose – The demand for higher bandwidth has resulted in the development of mm-wave phased array systems. This paper explores a technique that could be used to feed the individual antennas in a mm-wave phased array system with the appropriate phase shifted signal, to achieve required directivity. It presents differential Colpitts oscillators at 5 GHz and 60 GHz that can provide differential ou...
متن کاملAn Algebraic Construction of Discrete Wavelet Tranforms
Discrete wavelets are viewed as linear algebraic transforms given by banded orthogonal matrices which can be built up from small matrix blocks satisfying certain conditions. A generalization of the nite support Daubechies wavelets is discussed and some special cases promising more rapid signal reduction are derived.
متن کاملOn integral sum graphs
A graph G is said to be an integral sum graph if its nodes can be given a labeling f with distinct integers, so that for any two distinct nodes u and v of G, uv is an edge of G if and only if f (u) + f (v) = f (w) for some node w in G. A node of G is called a saturated node if it is adjacent to every other node of G. We show that any integral sum graph which is not K3 has at most two saturated ...
متن کاملRegular integral sum graphs
Given a set of integers S; G(S) = (S; E) is a graph, where the edge uv exists if and only if u+ v∈ S. A graph G = (V; E) is an integral sum graph or ISG if there exists a set S ⊂ Z such that G=G(S). This set is called a labeling of G. The main results of this paper concern regular ISGs. It is proved that all 2-regular graphs with the exception of C4 are integral sum graphs and that for every po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2022
ISSN: ['1945-5844', '0030-8730']
DOI: https://doi.org/10.2140/pjm.2022.318.305